Formal Presentation of Two Initial Variable Ordering
نویسندگان
چکیده
This paper present two variable ordering methods for minimizing Reduced Ordered Binary Decision Diagrams (ROBDDs). The broad formal techniques, based on graph topology, and the details of the algorithms are suitable for further work on other algorithms of the same family. Experiments have shown that the algorithms improve on common algorithms for the majority of benchmark circuits.
منابع مشابه
Evaluation of Static Variable Ordering Heuristics for MDD Construction
After designing of Multi-Valued Logic Networks (MVLNs), the resulting circuits have to be veri ed to guarantee functional correctness. The most promising technique to cope with increasing device sizes are formal methods. Ordered Multi-Valued Decision Diagrams (OMDDs) have been proposed for formal veri cation of MVLNs. But OMDDs are very sensitive to the chosen variable ordering and several orde...
متن کاملOptimality conditions for approximate solutions of vector optimization problems with variable ordering structures
We consider nonconvex vector optimization problems with variable ordering structures in Banach spaces. Under certain boundedness and continuity properties we present necessary conditions for approximate solutions of these problems. Using a generic approach to subdifferentials we derive necessary conditions for approximate minimizers and approximately minimal solutions of vector optimizatio...
متن کاملSet approach for set optimization with variable ordering structures
This paper aims at combining variable ordering structures with set relations in set optimization, which have been defined using the constant ordering cone before. Since the purpose is to connect these two important approaches in set optimization, we do not restrict our considerations to one certain relation. Conversely, we provide the reader with many new variable set relations generalizing the...
متن کاملWeb Service Choreography Verification Using Z Formal Specification
Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...
متن کاملMINCE: A Static Global Variable-Ordering for SAT and BDD
Many popular algorithms that work with Boolean functions are dramatically dependent on the order of variables in input representations of Boolean functions. Such algorithms include satisfiability (SAT) solvers that are critical in formal verification and Binary Decision Diagrams (BDDs) manipulation algorithms that are increasingly popular in synthesis and verification. Finding better variable-o...
متن کامل